#include<cstdio>
#include<algorithm>

using namespace std;
const int maxn=1e5+10;
int q[maxn];
int n,m;


int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++){
		scanf("%d",&q[i]);
	}
	
	while(m--){
		int x;
		scanf("%d",&x);
		int l=0,r=n-1;
		while(l<r){
			int mid=l+r>>1;
			if(q[mid]>=x) r=mid;
			else l=mid+1;
		}
		if(q[l]!=x) printf("-1 -1");
		else{
			printf("%d ",l);
			int l=0,r=n-1;
			while(l<r){
				int mid=l+r+1>>1;
				if(q[mid]<=x) l=mid;
				else r=mid-1;
			}
			printf("%d",l);
		}
	}
	return 0;
}
